Three-state von Neumann cellular automata and pattern generation
نویسندگان
چکیده
منابع مشابه
Von Neumann Regular Cellular Automata
For any group G and any set A, a cellular automaton (CA) is a transformation of the configuration space A G defined via a finite memory set and a local function. Let CA(G; A) be the monoid of all CA over A G. In this paper, we investigate a generalisation of the inverse of a CA from the semigroup-theoretic perspective. An element τ ∈ CA(G; A) is von Neumann regular (or simply regular) if there ...
متن کاملOn irreversibility of von Neumann additive cellular automata on grids
The von Neumann cellular automaton appears in many different settings in Operations Research varying from applications in Formal Languages to Biology. One of the major questions related to it is to find a general condition for irreversibility of a class of two-dimensional cellular automata on square grids ( +-automata). This question is partially answered here with the proposal of a sufficient ...
متن کاملSignal crossing solutions in von Neumann self-replicating cellular automata
Signal crossing is a significant problem within von Neumann cellular automata (29-states); only three solutions are known. This paper gives a thorough examination of these three solutions, including discussion of performance and the effective means of construction, including the mechanism of autoinitialisation. Application of these solutions within self-replicators is then examined for Nobili a...
متن کاملThe Cryptographic Properties of Von Neumann Cellular Automata
In this paper it is shown that two-dimensional cellular automata with Von Neumann neighborhoods are not suitable for cryptographic purposes. This result is obtained after analyzing the most important cryptographic properties of boolean functions defining their local transition rules 2000 Mathematics Subject Classifications: 68Q80, 94A60, 94C10
متن کاملConstructibility of Signal-Crossing Solutions in von Neumann 29-State Cellular Automata
In von Neumann 29-state cellular automata, the crossing of signals is an important problem, with three solutions reported in the literature. These solutions greatly impact automaton design, especially self-replicators. This paper examines these solutions, with emphasis upon their constructibility. We show that two of these solutions are difficult to construct, and offer an improved design techn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2015
ISSN: 0307-904X
DOI: 10.1016/j.apm.2014.10.025